Mixed Transitivity for Functional and Multivalued Dependencies in Database Relations
نویسنده
چکیده
منابع مشابه
Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis
Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of the notion of functional dependency are the socalled degenerate multivalued dependencies, and multivalued dependencies proper. We propose here a new Galois connection, based on a...
متن کاملMultivalued Dependencies in XML
Functional dependencies (FDs) and multivalued dependencies (MVDs) play a fundamental role in relational databases where they provide semantics for the data and at the same time are the foundation for database design. Since XML documents are closely coupled with relational databases in that XML documents are typically exported and imported from relational databases, the study of FDs and MVDs in ...
متن کاملOn a problem of Fagin concerning multivalued dependencies in relational databases
Multivalued dependencies (MVDs) are an important class of relational constraints that is fundamental to relational database design. Reflexivity axiom, complementation rule, and pseudo-transitivity rule form a minimal set of inference rules for the implication of MVDs. The complementation rule plays a distinctive role as it takes into account the underlying relation schema R which the MVDs are d...
متن کاملReasoning about Domain Semantics over Relations, Bags, Partial Relations, and Partial Bags
Quality database schemata must capture both the structure and semantics of the domain of interest. Classes of data dependencies have been studied extensively to model domain semantics. Traditionally, the theory of data dependencies has been limited to relations. In practice, duplicate and partial information are permitted to occur in database instances. These features are supported to make data...
متن کاملDiscovery of multivalued dependencies from relations
Discovery of multivalued dependencies from database relations is viewed as a search in a hypothesis space de ned according to the generalisation relationship among multivalued dependencies Two algorithms for the dis covery of multivalued dependencies from relations are presented The top down algorithm enumerates the hypotheses from the most general to more speci c hypotheses which are checked o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 10 شماره
صفحات -
تاریخ انتشار 1980